Some constructions of supermagic non-regular graphs
نویسندگان
چکیده
منابع مشابه
On Supermagic Regular Graphs
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. Some constructions of supermagic labellings of regular graphs are described. Supermagic regular complete multipartite graphs and supermagic cubes are characterized.
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملOn a Construction of Supermagic Graphs
Given two graphs G and H. The composition of G with H is the graph with vertex set V (G) × V (H) in which (u1, v1) is adjacent to (u2, v2) if and only if u1u2 ∈ E(G) or u1 = u2 and v1v2 ∈ E(H). In this paper, we prove that the composition of regular supermagic graph with a null graph is supermagic. With the help of this result we show that the composition of a cycle with a null graph is always ...
متن کاملA construction of supermagic graphs
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we will introduce a new construction of supermagic graphs using the special structure of their subgraphs. The supermagic complements of some bipartite grap...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 38 شماره
صفحات -
تاریخ انتشار 2007